Dependence of Two Different Fuzzy Clustering Techniques on Random Initialization and a Comparison
نویسندگان
چکیده
In the recent past Kernelized Fuzzy C-Means clustering technique has earned popularity especially in the machine learning community. This technique has been derived from the conventional Fuzzy C-Means clustering technique of Bezdek by defining the vector norm with the Gaussian Radial Basic Function instead of a Euclidean distance. Subsequently the fuzzy cluster centroids and the partition matrix are defined using this new vector norm. In our present work we have tried to show the effect of random initialization of the membership values on the performances of both these techniques. In addition to this we have tried to show the variation of the performance of Kernelized Fuzzy C-Means clustering technique with different values of the adjustable parameter of its vector norm. Using Partition Coefficient and Clustering Entropy as validity indices we have tried to make a comparison of the performances of these two clustering techniques. Keywords— Kernelized Fuzzy C-Means Clustering Technique, Fuzzy C-Means Clustering Technique, Gaussian Radial Basic Function, Euclidean Distance, Partition Coefficient, Clustering Entropy.
منابع مشابه
A Hybrid Time Series Clustering Method Based on Fuzzy C-Means Algorithm: An Agreement Based Clustering Approach
In recent years, the advancement of information gathering technologies such as GPS and GSM networks have led to huge complex datasets such as time series and trajectories. As a result it is essential to use appropriate methods to analyze the produced large raw datasets. Extracting useful information from large data sets has always been one of the most important challenges in different sciences,...
متن کاملFuzzy Clustering for Initialization of Simulated Annealing Algorithm to Solve a Capacitated Vehicle Routing Problem
Vehicle Routing Problem (VRP) has been an interesting research area since its introduction. There are various types of VRP models and different solution techniques proposed for this problem. This paper uses several clustering algorithms in initialization of Simulated Annealing to solve VRP. The main contribution of this research is to assess the effect of using some clustering methods in buildi...
متن کاملRobust fuzzy clustering algorithms in analyzing high-dimensional cancer databases
Due to uncertainty value of objects in microarray gene expression high dimensional cancer database, finding available subtypes of cancers is considered as challenging task. Researchers have invented mathematical assisted clustering techniques in clustering relevant gene expression of cancer subtypes, but the techniques have failed to provide proper outcome results with less error. Hence, it is ...
متن کاملImproved COA with Chaotic Initialization and Intelligent Migration for Data Clustering
A well-known clustering algorithm is K-means. This algorithm, besides advantages such as high speed and ease of employment, suffers from the problem of local optima. In order to overcome this problem, a lot of studies have been done in clustering. This paper presents a hybrid Extended Cuckoo Optimization Algorithm (ECOA) and K-means (K), which is called ECOA-K. The COA algorithm has advantages ...
متن کاملA Hybrid Data Clustering Algorithm Using Modified Krill Herd Algorithm and K-MEANS
Data clustering is the process of partitioning a set of data objects into meaning clusters or groups. Due to the vast usage of clustering algorithms in many fields, a lot of research is still going on to find the best and efficient clustering algorithm. K-means is simple and easy to implement, but it suffers from initialization of cluster center and hence trapped in local optimum. In this paper...
متن کامل